github.com/klauspost/compress/zstd.tableEntry.val (field)

66 uses

	github.com/klauspost/compress/zstd (current package)
		enc_better.go#L175: 			e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
		enc_better.go#L227: 						e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L284: 						e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L352: 			if s-coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
		enc_better.go#L509: 			e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L536: 			e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_better.go#L694: 			e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
		enc_better.go#L748: 						e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L808: 						e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L877: 			if s-coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
		enc_better.go#L1027: 			e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
		enc_better.go#L1056: 			e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_better.go#L1123: 				val:    uint32(cv),
		enc_better.go#L1127: 				val:    uint32(cv >> 8),
		enc_better.go#L1131: 				val:    uint32(cv >> 16),
		enc_better.go#L1135: 				val:    uint32(cv >> 24),
		enc_dfast.go#L133: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L184: 			if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L202: 			if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
		enc_dfast.go#L212: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L213: 				if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L298: 		te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
		enc_dfast.go#L299: 		te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
		enc_dfast.go#L306: 		te0.val = uint32(cv0)
		enc_dfast.go#L307: 		te1.val = uint32(cv1)
		enc_dfast.go#L333: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L439: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L491: 			if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L509: 			if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
		enc_dfast.go#L519: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L520: 				if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L602: 		te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
		enc_dfast.go#L603: 		te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
		enc_dfast.go#L610: 		te0.val = uint32(cv0)
		enc_dfast.go#L611: 		te1.val = uint32(cv1)
		enc_dfast.go#L638: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L779: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L832: 			if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L850: 			if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
		enc_dfast.go#L860: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L862: 				if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
		enc_dfast.go#L947: 		te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
		enc_dfast.go#L948: 		te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
		enc_dfast.go#L959: 		te0.val = uint32(cv0)
		enc_dfast.go#L960: 		te1.val = uint32(cv1)
		enc_dfast.go#L990: 			entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_dfast.go#L1059: 				val:    uint32(cv),
		enc_dfast.go#L1066: 					val:    uint32(cv),
		enc_fast.go#L22: 	val    uint32
		enc_fast.go#L130: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L131: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L174: 			if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
		enc_fast.go#L186: 			if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
		enc_fast.go#L258: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L367: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L368: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L412: 			if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
		enc_fast.go#L427: 			if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
		enc_fast.go#L498: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L627: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L629: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L674: 			if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
		enc_fast.go#L686: 			if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
		enc_fast.go#L758: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L823: 					val:    uint32(cv),
		enc_fast.go#L827: 					val:    uint32(cv >> 8),